import java.util.*;

public class day1 {
    /**
     * DP45 分割等和子集
     * https://www.nowcoder.com/practice/65ade309fa4d4067a9add749721bfdc0?tpId=230&tqId=40433&ru=/exam/oj
     */
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] arr = new int[n + 1];
        int sum = 0;
        for(int i = 1;i <= n;i++) {
            arr[i] = in.nextInt();
            sum += arr[i];
        }
        int[][] dp = new int[n + 1][sum + 1];
        if(sum % 2 == 1) {
            System.out.println("false");
        }else {
            int sumHalf = sum / 2;
            dp[0][0] = 0;
            for(int i = 1;i <= n;i++) {
                for(int j = 0;j <= sumHalf;j++) {
                    dp[i][j] = dp[i - 1][j];
                    if(j >= arr[i]) {
                        dp[i][j] = Math.max(dp[i][j],dp[i - 1][j - arr[i]] + arr[i]);
                    }
                }
            }
            if(dp[n][sumHalf] == sumHalf) {
                System.out.println("true");
            }else {
                System.out.println("false");
            }
        }
    }



    /**
     * NC383 主持人调度（一）
     * https://www.nowcoder.com/practice/e160b104354649b69600803184094adb?tpId=196&tqId=40514&ru=/exam/oj
     */
    public boolean hostschedule (ArrayList<ArrayList<Integer>> schedule) {
        int m = schedule.size(),n = schedule.get(0).size();
        int[][] arr = new int[m][n];
        for(int i = 0;i < m;i++) {
            for(int j = 0;j < n;j++) {
                arr[i][j] = schedule.get(i).get(j);
            }
        }
        // 对其进行排序
        Arrays.sort(arr,(v1,v2) -> {
            // 按照第一个元素进行排序
            return v1[0] - v2[0];
        });
        // 按照左侧第一个数据的升序排序

        // 这样直接进行比较后一个第一个和前一个最后一个 数据进行比较即可
        for(int i = 1;i < m;i++) {
            if(arr[i][0] < arr[i - 1][1]) {
                return false;
            }
        }
        return true;
    }



    /**
     * BC145 笨小猴
     * https://www.nowcoder.com/practice/17865bc2a75c4944a872ef709958c56e?tpId=290&tqId=39933&ru=/exam/oj
     */
    public static void main1(String[] args) {
        Scanner in = new Scanner(System.in);
        char[] str = in.next().toCharArray();
        int n = str.length;
        int[] hash = new int[26];
        int max = 0,min = 101;
        for(int i = 0;i < n;i++) {
            hash[str[i] - 'a']++;
        }
        for(int i = 0;i < 26;i++) {
            if(hash[i] > 0) {
                max = Math.max(max,hash[i]);
                min = Math.min(min,hash[i]);
            }
        }
        // 判断是否是质数
        int t = max - min;
        boolean flag = isprim(t);
        if(flag) {
            System.out.println("Lucky Word");
            System.out.println(t);
        }else {
            System.out.println("No Answer");
            System.out.println(0);
        }
    }

    public static boolean isprim(int t) {
        if(t < 2) {
            return false;
        }
        for(int i = 2;i < Math.sqrt(t);i++) {
            if(t % i == 0) {
                return true;
            }
        }
        return true;
    }
}
